What Is an Opinion About%3F Exploring Political Standpoints Using Opinion Scoring Model.

BASIL Effective Near%2DDuplicate Image Detection Using Gene Sequence Alignment.
Abstract. Finding near-duplicate images is a task often found in Multimedia Information Retrieval (MIR). Toward this effort, we propose a novel idea by bridging two seemingly unrelated fields – MIR and Biology. That is, we propose to use the popular gene sequence alignment algorithm in Biology, i.e., BLAST, in detecting near-duplicate images. Under the new idea, we study how various image features and gene sequence generation methods (using gene alphabets such as A, C, G, and T in DNA sequences) affect the accuracy and performance of detecting near-duplicate images. Our proposal, termed as BLASTed Image Linkage (BASIL), is empirically validated using various real data sets. This work can be viewed as the “first ” step toward bridging MIR and Biology fields in the well-studied near-duplicate image detection problem.
HARRA fast iterative hashed record linkage for large%2Dscale data collections.
We study the performance issue of the “iterative ” record linkage (RL) problem, where match and merge operations may occur together in iterations until convergence emerges. We first propose the Iterative Locality-Sensitive Hashing (I-LSH) that dynamically merges LSH-based hash tables for quick and accurate blocking. Then, by exploiting inherent characteristics within/across data sets, we develop a suite of I-LSH-based RL algorithms, named as HARRA (HAshed RecoRd linkAge). The superiority of HARRA in speed over competing RL solutions is thoroughly validated using various real data sets. While maintaining equivalent or comparable accuracy levels, for instance, HARRA runs: (1) 4.5 and 10.5 times faster than StringMap and R-Swoosh in iteratively linking 4,000 × 4,000 short records (i.e., one of the small test cases), and (2) 5.6 and 3.4 times faster than basic LSH and Multi-Probe LSH algorithms in iteratively linking 400,000 × 400,000 long records (i.e., the largest test case). 1.
Ontology based information distribution in the pervasive display environment.

T3 On Mapping Text To Time Series.
Abstract. We investigate if the mapping between text and time series data is feasible such that relevant data mining problems in text can find their counterparts in time series (and vice versa). As a preliminary work, we present the T 3 (T ext T o T ime series) framework that utilizes different combinations of granularity (e.g., character or word level) and n-grams (e.g., unigram or bigram). To assign appropriate numeric values to each character, T 3 adopts different space-filling curves (e.g., linear, Hilbert, Z orders) based on the keyboard layout. When we applied T 3 approach to the “record linkage ” problem, despite the lossy transformation, T 3 achieved comparable accuracy with considerable speed-up. 1
The design and evaluation of a virtual world%2Dbased learning environment information security learning using Second Life.

On Protecting Private Information in Social Networks AProposal.

BIM Image matching using biological gene sequence alignment.
Matching two images with similar contents is one of the most fundamental tasks in image processing. Due to its importance, in recent years, many novel techniques have been proposed with great successes. Toward this effort, in this paper, we propose a radically different idea by bridging two seemingly unrelated fields – Image Processing and Biology – i.e., we propose to use the popular gene sequence alignment algorithm in Biology, BLAST, in determining the similarity between images. In this proposal, we map image features to a sequence of gene alphabets (e.g., A, C, G, and T in DNA, or 23 letters in protein) to utilize a wealth of advanced algorithms and tools in BLAST. Under the new idea, in particular, we study various images features and gene sequence generation methods that impact the accuracy and performance in matching similar images. Our proposal, termed as BLASTed Image Matching (BIM), is empirically validated using real data sets. Our work can be viewed as the “first ” step toward bridging Image Processing and Biology fields in the application of the well-studied image matching problem.
High%2DPerformance Buffer Mapping to Exploit DRAM Concurrency in Multiprocessor DSP Systems.
Design methodologies and tools based on the synchronous dataflow (SDF) model of computation have proven useful for rapid prototyping and implementation of digital signal processing (DSP) applications on multiprocessor systems. One significant problem that arises when mapping applications onto such embedded multiprocessors is the memory wall problem, which is becoming increasingly dominant in multiprocessor environments. In this paper, to help alleviate the memory wall problem, we propose a novel, highperformance buffer mapping policy for SDF-represented DSP applications on multiprocessor systems that support the shared-memory programming model. The proposed policy exploits the bank concurrency of a DRAM main memory system according to the analysis of the major forms of parallelism. The throughput is measured on both synthetic and real benchmarks. The simulation results show that the proposed buffer mapping policy is very useful, especially in memory-intensive applications where the total execution time of computational tasks is relatively small compared to that of memory operations. The performance improvement produced by our method is generally attained at the cost of additional banks and decreased bank utilization. 1
Efficient Abstraction and Refinement for Behavioral Description Based Web Service Composition.
The Web Service Composition (WSC) problem with respect to behavioral descriptions deals with the automatic synthesis of a coordinator web service, c, that controls a set of web services to reach a goal state. Despite its importance, however, solving the WSC problem for a general case (when c has only partial observations) remains to be doubly exponential in the number of variables in web service descriptions, rendering any attempts to compute an exact solution for modest size impractical. Toward this challenge, in this paper, we propose two novel (signature preserving and subsuming) approximation-based approaches using abstraction and refinement. We empirically validate that our proposals can solve realistic problems efficiently. 1
Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces.
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To address this challenge, we propose two novel semi-supervised clustering methods that incorporate prior knowledge in the form of pairwise cluster membership constraints. In particular, we project high-dimensional data onto a much reduced-dimension subspace, where rough clustering structure defined by the prior knowledge is strengthened. Metric learning is then performed on the subspace to construct more informative pairwise distances. We also propose to propagate constraints locally to improve the informativeness of pairwise distances. When the new methods are evaluated using two real benchmark data sets, they show substantial improvement using only limited prior knowledge. 1
Automatic web service composition with abstraction and refinement.
The behavioral description based Web Service Composition (WSC) problem aims at the automatic construction of a coordinator web service that controls a set of web services to reach a goal state. However, solving the WSC problem exactly with a realistic model is doubly-exponential in the number of variables in web service descriptions. In this paper, we propose a novel efficient approximation-based algorithm using automatic abstraction and refinement to dramatically reduce the number of variables needed to solve the problem.
Oracle%2C where shall I submit my papers%3F
In April 2005, a group of MIT students pulled prank [1] on the conference – “World Multi-Conference on Systemics, Cybernetics and Informatics (WMSCI) ” [10]  – known for sending unsolicited invitation emails to people in academia. The MIT students used software to generate bogus research papers, complete with context-free grammar, and submitted two of them to the
XML Access Control.
 In this paper we present an access control framework that provides flexible security granularity for XML documents. RDF statements are used to represent security objects and to express security policy. The concepts of simple security object and association security object are defined. Our model allows to express and enforce access control on XML trees and their associations. Access control rules, corresponding to (s, o, ±a) triples, are represented as RDF statements with properties access type, user, and object. A history file is maintained for each user that allows decision-making using temporal data.
Oracle%2C where shall I submit my papers%3F
In April 2005, a group of MIT students pulled prank [1] on the conference – “World Multi-Conference on Systemics, Cybernetics and Informatics (WMSCI) ” [10]  – known for sending unsolicited invitation emails to people in academia. The MIT students used software to generate bogus research papers, complete with context-free grammar, and submitted two of them to the
Security Education Using Second Life.
Institutions of higher education, government agencies, and private organizations have been making sustained efforts to teach some information security skills more efficiently. In these efforts to improve security education, the dominant pedagogical approach has been to use security exercises in a lab setting. However, this approach might not deliver effective learning experiences for two reasons: • Narrow focus on technology. Current laboratory exercises focus on security attacks and technical solutions, yet security management must also account for operations and people. 1 Failing
Security Education Using Second Life.
Institutions of higher education, government agencies, and private organizations have been making sustained efforts to teach some information security skills more efficiently. In these efforts to improve security education, the dominant pedagogical approach has been to use security exercises in a lab setting. However, this approach might not deliver effective learning experiences for two reasons: • Narrow focus on technology. Current laboratory exercises focus on security attacks and technical solutions, yet security management must also account for operations and people. 1 Failing
WSBen A Web Services Discovery and Composition Benchmark Toolkit1.
In this article, a novel benchmark toolkit, WSBen, for testing web services discovery and composition algorithms is presented. The WSBen includes: (1) a collection of synthetically generated web services files in WSDL format with diverse data and model characteristics; (2) queries for testing discovery and composition algorithms; (3) auxiliary files to do statistical analysis on the WSDL test sets; (4) converted WSDL test sets that conventional AI planners can read; and (5) a graphical interface to control all these behaviors. Users can fine-tune the generated WSDL test files by varying underlying network models. To illustrate the application of the WSBen, in addition, we present case studies from three domains: (1) web service composition; (2) AI planning; and (3) the laws of networks in Physics community. It is our hope that WSBen will provide useful insights in evaluating the performance of web services discovery and composition algorithms. The WSBen toolkit is available at:
Modeling idiosyncratic properties of collaboration networks revisited.
A study on the network characteristics of two collaboration networks constructed from the ACM and DBLP digital libraries is presented. Different types of generic network models and several examples are reviewed and experimented on re-generating the collaboration networks. The results reveal that while these models can generate the power-law degree distribution sufficiently well, they are not able to capture the other two important dynamic metrics: average distance and clustering coefficient. While all current models result in small average distances, none shows the same tendency as the real networks do. Furthermore all models seem blind to generating large clustering coefficients. To remedy these shortcomings, we propose a new model with promising results. We get closer values for the dynamic measures while having the degree distribution still power-law by having link addition probabilities change over time, and link attachment happen within local neighborhood only or globally, as seen in the two collaboration networks.
Graph Theoretic Topological Analysis of Web Service Networks.
Abstract Using graph theory, we analyze the topological landscape of web service networks formed by real-world data set, either downloaded from web service repositories or crawled by a search engine. We first propose a flexible framework to study syntactic web service matchmaking in a unified manner. Under the framework, then, the data set is analyzed from diverse perspectives and granularity. By and large, the data set is shown to exhibit small world network well and power-law-like distribution to some extent. Finally, using random graph theory, we demonstrate how to accurately estimate the size of the giant component of such web service networks. Keywords web services · small world · power-law · giant component · matchmaking A preliminary version [17] of this paper was presented at the SMR ’06: VLDB Workshop
Type%2DAware Web Service Composition Using Boolean Satisfiability Solver.
The goal of the Web Service Composition (WSC) problem is to find an optimal “composition ” of web services to satisfy a given request using their syntactic and/or semantic features, when no single service satisfies it. In this paper, in particular, we study the WSC problem from semantic aspects, exploiting the supertype-subtype relationship among parameters, and propose a novel solution based on the boolean satisfiability problem (SAT). Given a set of web service descriptions and a requirement web service, we reduce the WSC problem into a reachability problem on a state-transition system, and show that the shortest path found is amount to the optimal composition. A preliminary experiment using 7 examples reveals that our proposal can find optimal compositions of web services efficiently. 1.
A Web Service Composition Framework Using Integer Programming with Non%2Dfunctional Objectives and Constraints.
In this paper, we propose a Web service composition framework that uses Integer Linear Programming with non-functional objectives and constraints, in addition to the syntactic matching of Web services features. We envision that when Web services are fully deployed and commercialized in the near future, the criteria of Web service composition to achieve objectives will vary depending on users ’ needs or preferences from the number of Web services to non-functional objectives, such as costs, time, and/or reputation. Such non-functional attributes cannot be readily considered in planning-graph, constraint satisfaction, or propositional satisfiability techniques, which are predominantly logic-based. This paper shows how the proposed Integer Linear Programming framework can be utilized to compose Web services with non-functional attributes. This framework enables our composition software agent to identify the best composition result that satisfies both non-functional requirements as well as functional ones, namely, parameter matching. A preliminary implementation of the proposed idea and further research directions are also discussed. 1.
A Web Service Composition Framework Using Integer Programming with Non%2Dfunctional Objectives and Constraints.
In this paper, we propose a Web service composition framework that uses Integer Linear Programming with non-functional objectives and constraints, in addition to the syntactic matching of Web services features. We envision that when Web services are fully deployed and commercialized in the near future, the criteria of Web service composition to achieve objectives will vary depending on users ’ needs or preferences from the number of Web services to non-functional objectives, such as costs, time, and/or reputation. Such non-functional attributes cannot be readily considered in planning-graph, constraint satisfaction, or propositional satisfiability techniques, which are predominantly logic-based. This paper shows how the proposed Integer Linear Programming framework can be utilized to compose Web services with non-functional attributes. This framework enables our composition software agent to identify the best composition result that satisfies both non-functional requirements as well as functional ones, namely, parameter matching. A preliminary implementation of the proposed idea and further research directions are also discussed. 1.
Video linkage group based copied video detection.
Sites to share user-created video clips such as YouTube and Yahoo Video have become greatly popular in recent years. One of the challenges of such sites is, however, to prevent video clips that violate copyrights by illegally copying and editing scenes from other videos. Due to the sheer number of clips uploaded every day, automatic methods to detect (illegally) copied video clips in a large collection are desirable. Toward this problem, in this paper, we present a novel framework, termed as Video Linkage, that is based on the record linkage techniques. Our proposal is based on the observations that: (1) a video clip can be represented as a “group ” of key frames, (2) two video clips are deemed to be similar if two groups of key frames are similar as a whole – i.e., the similarity of two video clips can be measured by means of graph-based similarity measures such as maximal cardinality bipartite matching, and (3) if a video clip va is copied to vb, then va and vb must be somehow similar, but not all similar video clips are illegally copied ones – i.e., similar videos can be used as a filter for fast detection of copied videos. The validity of our observations and Video Linkage technique is thoroughly evaluated using both real and synthetic data sets – i.e., on average, our proposals achieved 0.94 as precision and 0.93 as recall across 10 genres and 6 editing patterns.
Defending against Attribute%2DCorrelation Attacks in Privacy%2DAware Information Brokering.
Abstract. Nowadays, increasing needs for information sharing arise due to extensive collaborations among organizations. Organizations desire to provide data access to their collaborators while preserving full control over the data and comprehensive privacy of their users. A number of information systems have been developed to provide efficient and secure information sharing. However, most of the solutions proposed so far are built atop of conventional data warehousing or distributed database technologies. Recently, information brokering systems have been proposed to provide privacy-preserving information sharing among loosely federated data sources. However, they are still vulnerable to attribute-correlation attacks during query routing, due to the lack of protection of the routed queries. In this paper, we investigate the problems caused by such an attack, and propose a countermeasure by limiting the view of query content at each intermediate broker. We show that the proposed content-based XPath query routing scheme with level-based encryption and commutative encryption can effectively prevent an attribute-correlation attack originated by compromised brokers, with reasonable overhead. Key words: information brokering, attribute correlation attack, privacy,
DL2Go Editable Digital Libraries in the Pocket.
Abstract. A preliminary framework, termed as DL2Go, that enables editable and portable personal digital libraries is presented. For mobile offline users of digital libraries, DL2Go can: (1) package digital libraries into mobile storage devices such as flash drives, along with needed application softwares (e.g., wiki and DBMS), (2) (de-)compress contents of digital libraries to address storage constraints of mobile users when needed, (3) enables users to add, delete, and update entities of digital libraries using wiki framework, and (4) share/sync edited contents with other DL2Go users and the server using web services and RSS framework. 1
Computational Complexity of Web Service Composition Based on Behavioral Descriptions.

LeeDeo Web%2DCrawled Academic Video Search Engine.

The ACL Anthology Reference Corpus A Reference Dataset for Bibliographic Research in Computational Linguistics.
The ACL Anthology is a digital archive of conference and journal papers in natural language processing and computational linguistics. Its primary purpose is to serve as a reference repository of research results, but we believe that it can also be an object of study and a platform for research in its own right. We describe an enriched and standardized reference corpus derived from the ACL Anthology that can be used for research in scholarly document processing. This corpus, which we call the ACL Anthology Reference Corpus (ACL ARC), brings together the recent activities of a number of research groups around the world. Our goal is to make the corpus widely available, and to encourage other researchers to use it as a standard testbed for experiments in both bibliographic and bibliometric research. 1.
Record Linkage as DNA Sequence Alignment Problem.
Since modern database applications increasingly need to deal with dirty data due to a variety of reasons (e.g., data entry errors, heterogeneous formats, and ambiguous terms), considerable recent efforts have focused on the (record) linkage problem to determine if two entities represented as relational records are approximately the same or not. In this paper, we propose a novel idea of using the popular gene sequence alignment algorithm in Biology – BLAST. Our proposal, termed as the BLASTed linkage, is based on the observations that: (1) both problems are variants of approximate pattern matching, (2) BLAST provides the statistical guarantee of search results in a scalable manner – a greatly lacking feature in many linkage solutions, and (3) by transforming the record linkage problem into the gene sequence alignment problem, one can leverage on a wealth of advanced algorithms, implementations, and tools that have been actively developed for BLAST during the last decade. In translating English alphabets to DNA sequences of A, C, G, and T, we study four variations: (1) default – each alphabet is mapped to nucleotides under 1, 2, and 4-bit coding schemes, (2) weighted – tokens are elongated or shortened proportional to their importance, making important tokens longer in the resultant DNA sequences, (3) hybrid – each token’s lexical meaning as well as its importance are considered at the same time during translation, and (4) multi-bit – tokens are selected for any of 1, 2, and 4-bit coding schemes based on the cumulative distribution functions of their importance. The efficacy of our proposed BLASTed linkage schemes are experimentally validated using both real and synthetic data sets. 1.
Efficient Web%2DBased Linkage of Short to Long Forms.
Abbreviations, acronyms, initialisms, and shortenings frequently occur in many texts found on the Web, such as publication metadata, stock ticker codes, and biological articles. To connect these disparate forms together for knowledge discovery, short forms must be properly linked to their canonical long forms. In this paper, we demonstrate how a search engine can be efficiently utilized in mining the required contextual information, so that short forms can be effectively linked to long forms. We show that a count-based method consistently outperforms other methods, and that using the snippets is better than using the full web pages. We also consider adaptively combining a query probing algorithm together with our count-based method. This reduces running time and network bandwidth, while maintaining the strong linkage performance. Keywords abbreviation matching, web as information resource, query probing, record linkage 1.

Effective Web Service Composition in Diverse and Large%2DScale Service Networks.
Abstract—Web services are considered to be a potential silver bullet for the envisioned Service Oriented Architecture, in which loosely coupled software components are published, located, and executed as integral parts of distributed applications. The main research focus of Web services is to achieve the interoperability between distributed and heterogeneous applications. Therefore, flexible composition of Web services to fulfill the given challenging requirements is one of the most important objectives in this research field. However, until now, service composition has been largely an error-prone and tedious process. Furthermore, as the number of available Web services increases, finding the right Web services to satisfy the given goal becomes intractable. In this paper, toward these issues, we propose an AI planning-based framework that enables the automatic composition of Web services, and explore the following issues. First, we formulate the Web service composition problem in terms of AI planning and network optimization problems to investigate its complexity in detail. Second, we analyze publicly available Web service sets using network analysis techniques. Third, we develop a novel Web service benchmark tool called WSBen. Fourth, we develop a novel AI planning-based heuristic Web service composition algorithm named WSPR. Finally, we conduct extensive experiments to verify WSPR against state-of-the-art AI planners. It is our hope that both WSPR and WSBen will provide useful insights for researchers to develop Web service discovery and composition algorithms, and software.

Automaton segmentation a new approach to preserve privacy in xml information brokering.
A Distributed Information Brokering System (DIBS) is a peer-to-peer overlay network that comprises diverse data servers and brokering components helping client queries locate the data server(s). Many existing information brokering systems adopt server side access control deployment and honest assumptions on brokers. However, little attention has been drawn on privacy of data and metadata stored and exchanged within DIBS. In this paper, we address privacypreserving information sharing via on-demand information access. We propose a flexible and scalable system using a broker-coordinator overlay network. Through an innovative automaton segmentation scheme, distributed access control enforcement, and query segment encryption, our system integrates security enforcement and query forwarding while preserving system-wide privacy. We present the automaton segmentation approach, analyze privacy preservation in details, and finally examine the end-to-end performance and scalability through experiments and analysis.
Incremental adaptation of XPath access control views.

HICCUP Hierarchical Clustering Based Value Imputation using Heterogeneous Gene Expression Microarray Datasets.

Semantic Web%2DService Discovery and Composition Using Flexible Parameter Matching.
When there are a large number of web services available and no single service satisfies the given request, one has to compose multiple web services to fulfill the goal, considering syntactic and semantic aspects. To address the web service composition issue, in this paper, we present a new composition algorithm by extending our previous work, WSRP (Web-service Planner) so as to determine relations between different parameter types during the process of service composition. 1.
Parallel linkage.
Genome duplication is an important source of new gene functions and novel physiological pathways. In the course of evolution, the nucleotide sequences of duplicated genes tend to diverge through mutation, so that one copy loses function (becomes a pseudogene) or develops a new function, encoding a distinct but similar product. Originally a duplicated genome contains two identical copies of each chromosome, but through inversion or other intrachromosomal movement, the gene orders in each pair of chromosomes change independently, and through reciprocal translocation, parallel linkage patterns between the two copies are disrupted. Eventually, all that can be detected are several chromosome segments of greater or lesser length (blocks), each of which appears twice in the genome, containing many paralogous genes in parallel orders. The study of genome duplication based on block data includes the inference of the synteny or linkage structure of the pre-duplication genome, the ...
Security%2DConscious XML Indexing.
Abstract. To support secure exchanging and sharing of XML data over the Internet, a myriad of XML access control mechanisms have been proposed. In the setting of node-level fine-grained access control, query evaluation is a process of locating XML nodes that (1) satisfy query constraints, and (2) do not violate security policies. In this regard, we propose and empirically validate a suite of XML indices for multi-level XML security model. 1
Pragmatic XML Access Control Using Off%2Dthe%2DShelf RDBMS.
Abstract. As the XML model gets more popular, new needs arise to specify access control within XML model. Various XML access control models and enforcement methods have been proposed recently. However, by and large, these approaches either assume the support of security features from XML databases or use proprietary tools outside of databases. Since there are currently few commercial XML databases with such capabilities, the proposed approaches are not yet practical. Therefore, we explore the problem of “Is is possible to fully support XML access control in RDBMS? ” We formalize XML and relational access control models using deep set operators. Then we show that the problem of XML AC atop RDBMS is amount to the problem of converting XML deep set operators into equivalent relational deep set operators. We show the conversion algebra and identify the properties to ensure the correct conversion. Finally, we present three practical implementations of XML access controls using off-the-shelf RDBMS and their performance results. 1
Group Linkage.
4 The first two authors contributed equally to this manuscript Data analysis and visualization is strongly influenced by noise and noise filters. There are multiple sources of “noise ” in microarray data analysis, but signal/noise ratios are rarely optimized, or even considered. Here, we report a noise analysis of a novel 13 million oligonucleotide dataset- 25 human U133A (~500,000 features) profiles of patient muscle biposies. We use our recently described interactive visualization tool, the Hierarchical Clustering Explorer (HCE) to systemically address the effect of different noise filters on resolution of arrays into “correct ” biological groups (unsupervised clustering into three patient groups of known diagnosis). We varied probe set interpretation methods (MAS 5.0, RMA), “present call ” filters, and clustering linkage methods, and investigated the results in HCE. HCE’s interactive features enabled us to quickly see the impact of these three variables. Dendrogram displays showed the clustering results systematically, and color mosaic displays provided a visual support for the results. We show that each of these three variables has a strong effect on unsupervised clustering. For this dataset, the strength of the biological variable was maximized, and noise minimized, using MAS 5.0, 10 % present call filter, and Average Group Linkage. We propose a general method of using interactive tools to identify the optimal signal/noise balance or the optimal combination of these three variables to maximize the effect of the desired biological variable on data interpretation.
Adaptive sorted neighborhood methods for efficient record linkage.
Traditionally, record linkage algorithms have played an important role in maintaining digital libraries - i.e., identifying matching citations or authors for consolidation in updating or integrating digital libraries. As such, a variety of record linkage algorithms have been developed and deployed successfully. Often, however, existing solutions have a set of parameters whose values are set by human experts off-lineand are fixed during the execution. Since finding the ideal values of such parameters is not straightforward, or no such single ideal value even exists, the applicability of existing solutions to new scenarios or domains is greatly hampered. To remedy this problem, we argue that one can achieve significant improvement by adaptively and dynamically changing such parameters of record linkage algorithms. To validate our hypothesis, we take a classical record linkage algorithm, the sorted neighborhood method (SNM), and demonstrate how we can achieve improved accuracy and performance by adaptively changing its fixed sliding window size. Our claim is analytically and empirically validated using both real and synthetic data sets of digital libraries and other domains.
Measuring conference quality by mining program committee characteristics.
Bibliometrics are important measures for venue quality in digital libraries. Impacts of venues are usually the major consideration for subscription decision-making, and for ranking and recommending high-quality venues and documents. For digital libraries in the Computer Science literature domain, conferences play a major role as an important publication and dissemination outlet. However, with a recent profusion of conferences and rapidly expanding fields, it is increasingly challenging for researchers and librarians to assess the quality of conferences. We propose a set of novel heuristics to automatically discover prestigious (and lowquality) conferences by mining the characteristics of Program Committee members. We examine the proposed cues both in isolation and combination under a classification scheme. Evaluation on a collection of 2,979 conferences and 16,147 PC members shows that our heuristics, when combined, correctly classify about 92 % of the conferences, with a low false positive rate of 0.035 and a recall of more than 73 % for identifying reputable conferences. Furthermore, we demonstrate empirically that our heuristics can also effectively detect a set of low-quality conferences, with a false positive rate of merely 0.002. We also report our experience of detecting two previously unknown low-quality conferences. Finally, we apply the proposed techniques to the entire quality spectrum by ranking conferences in the collection.
Toward alternative measures for ranking venues a case of database research community.

Scalable Name Disambiguation using Multi%2Dlevel Graph Partition.

Web based linkage.
Abbreviations, acronyms, initialisms, and shortenings frequently occur in many texts found on the Web, such as publication metadata, stock ticker codes, and biological articles. To connect these disparate forms together for knowledge discovery, short forms must be properly linked to their canonical long forms. In this paper, we demonstrate how a search engine can be efficiently utilized in mining the required contextual information, so that short forms can be effectively linked to long forms. We show that a count-based method consistently outperforms other methods, and that using the snippets is better than using the full web pages. We also consider adaptively combining a query probing algorithm together with our count-based method. This reduces running time and network bandwidth, while maintaining the strong linkage performance. Keywords abbreviation matching, web as information resource, query probing, record linkage 1.
Are your citations clean%3F
If the are, only one can refer to a distinct document; if not, many can refer to the same document.
An efficient location encoding method for moving objects using hierarchical administrative district and road network.

Web Service Planner %28WSPR%29 An Effective and Scalable Web Service Composition Algorithm.

Practical maintenance of evolving metadata for digital preservation algorithmic solution and system support.

Report on the First International VLDB Workshop on Clean Databases %28CleanDB 2006%29.

Algorithms for Web Services Discovery and Composition Based on Syntactic and Semantic Service Descriptions.

Multivariate Stream Data Classification Using Simple Text Classifiers.

Improving Grouped%2DEntity Resolution Using Quasi%2DCliques.
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular, we focus on resolving entities that contain a group of related elements in them (e.g., an author entity with a list of citations, a singer entity with song list, or an intermediate result by GROUP BY SQL query). Such entities, named as grouped-entities, frequently occur in many applications. The previous approaches toward grouped-entity resolution often rely on textual similarity, and produce a large number of false positives. As a complementing technique, in this paper, we present our experience of applying a recently proposed graph mining technique, Quasi-Clique, atop conventional ER solutions. Our approach exploits contextual information mined from the group of elements per entity in addition to syntactic similarity. Extensive experiments verify that our proposal improves precision and recall up to 83 % when used together with a variety of existing ER solutions, but never worsens them. 1
WSBen A Web Services Discovery and Composition Benchmark.
In this article, a novel benchmark toolkit, WSBen, for testing web services discovery and composition algorithms is presented. The WSBen includes: (1) a collection of synthetically generated web services files in WSDL format with diverse data and model characteristics; (2) queries for testing discovery and composition algorithms; (3) auxiliary files to do statistical analysis on the WSDL test sets; (4) converted WSDL test sets that conventional AI planners can read; and (5) a graphical interface to control all these behaviors. Users can fine-tune the generated WSDL test files by varying underlying network models. To illustrate the application of the WSBen, in addition, we present case studies from three domains: (1) web service composition; (2) AI planning; and (3) the laws of networks in Physics community. It is our hope that WSBen will provide useful insights in evaluating the performance of web services discovery and composition algorithms. The WSBen toolkit is available at:
Search engine driven author disambiguation.
CONTACT INFORMATION
OpenArXiv %3D arXiv   RDBMS   web services.

An effective approach to entity resolution problem using quasi%2Dclique and its application to digital libraries.
We study how to resolve entities that contain a group of related elements in them (e.g., an author entity with a list of citations or an intermediate result by GROUP BY SQL query). Such entities, named as grouped-entities, frequently occur in many applications. By exploiting contextual information mined from the group of elements per entity in addition to syntactic similarity, we show that our approach, Quasi-Clique, improves precision and recall unto 91 % when used together with a variety of existing entity resolution solutions, but never worsens them.

In%2Dbroker Access Control Towards Efficient End%2Dto%2DEnd Performance of Information Brokerage Systems.


Report on the 7th ACM International Workshop on Web Information and Data Management %28WIDM 2005%29.
Systems (IQIS 2004 and IQIS 2005)........................................................................................... 50
Report on the 7th ACM International Workshop on Web Information and Data Management %28WIDM 2005%29.
Systems (IQIS 2004 and IQIS 2005)........................................................................................... 50
A comparative illustration of AI planning%2Dbased web services composition.
As the number of available web services proliferates, finding right web services to fulfill a given goal becomes an important task. In particular, a problem of combining multiple web services to satisfy a single task, known as web services composition problem, has received much attention recently, and various solutions have been proposed. Among many proposed solutions, however, it is not clear to use which one in what scenarios. In this paper, to this end, we present: (1) a taxonomy and decision guideline of available solution spaces; (2) an overview of syntactic and semantic matching approaches, and (3) a comparative illustration of three representative solutions from the perspective of e-service workflows.
A comparative illustration of AI planning%2Dbased web services composition.
As the number of available web services proliferates, finding right web services to fulfill a given goal becomes an important task. In particular, a problem of combining multiple web services to satisfy a single task, known as web services composition problem, has received much attention recently, and various solutions have been proposed. Among many proposed solutions, however, it is not clear to use which one in what scenarios. In this paper, to this end, we present: (1) a taxonomy and decision guideline of available solution spaces; (2) an overview of syntactic and semantic matching approaches, and (3) a comparative illustration of three representative solutions from the perspective of e-service workflows.
Seventh ACM International Workshop on Web Information and Data Management %28WIDM 2005%29

Establishing value mappings using statistical models and user feedback.
In this paper, we present a “value mapping ” algorithm that does not rely on syntactic similarity or semantic interpretation of the values. The algorithm first constructs a statistical model (e.g., co-occurrence frequency or entropy vector) that captures the unique characteristics of values and their co-occurrence. It then finds the matching values by computing the distances between the models while refining the models using user feedback through iterations. Our experimental results suggest that our approach successfully establishes value mappings even in the presence of opaque data values and thus can be a useful addition to the existing data integration techniques.
An Efficient Location Encoding Method Based on Hierarchical Administrative District.
Abstract. Due to the rapid development in mobile communication technologies, the usage of mobile devices such as cell phone or PDA becomes increasingly popular. As different devices require different applications, various new services are being developed to satisfy the needs. One of the popular services under heavy demand is the Location-based Service (LBS) that exploits the spatial information of moving objects per temporal changes. In order to support LBS efficiently, it is necessary to be able to index and query well a large amount of spatio-temporal information of moving objects. Therefore, in this paper, we investigate how such location information of moving objects can be efficiently stored and indexed. In particular, we propose a novel location encoding method based on hierarchical administrative district information. Our proposal is different from conventional approaches where moving objects are often expressed as geometric points in two dimensional space, (x, y). Instead, in ours, moving objects are encoded as one dimensional points by both administrative district as well as road information. Our method is especially useful for monitoring traffic situation or tracing location of moving objects through approximate spatial queries. Keywords: Location-Based Service, Road network, Moving object, Indexing 1
BF%2A Web Services Discovery and Composition as Graph Search Problem.
When there are a large number of web services available (e.g., in the range of 1,000- 10,000), it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to “compose ” multiple web services to fulfill the goal. Since the search space for such a composition problem is in general exponentially increasing, it is important to have wise decision on underlying data structures and search algorithms. Toward this problem, in this paper, we present a novel solution, named as BF * (BF-Star), that adopts the competitive A * as a search algorithm while utilizing the Bloom Filter as a succinct data structure. 1
Blocking%2Daware private record linkage.

Effective and scalable solutions for mixed and split citation problems in digital libraries.
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem (i.e., citations of different scholars with their names being homonyms are mixed together) and Split Citation (SC) problem (i.e., citations of the same author appear under different name variants). In particular, we investigate an effective yet scalable solution since citations in such digital libraries tend to be large-scale. After formally defining the problems and accompanying challenges, we present an effective solution that is based on the state-of-the-art sampling-based approximate join algorithm. Our claim is verified through preliminary experimental results.
Comparative study of name disambiguation problem using a scalable blocking%2Dbased framework.
In this paper, we consider the problem of ambiguous author names in bibliographic citations, and comparatively study alternative approaches to identify and correct such name variants (e.g., &#034;Vannevar Bush&#034; and &#034;V. Vush&#034;). Our study is based on a scalable two-step framework, where step 1 is to substantially reduce the number of candidates via blocking, and step 2 is to measure the distance of two names via coauthor information. Combining four blocking methods and seven distance measures on four data sets, we present extensive experimental results, and identify combinations that are scalable and effective to disambiguate author names in citations.
Pollock automatic generation of virtual web services from web sites.
As the usage of Web Services proliferates dramatically, new tools to help quickly generate web services are needed. In this paper, we propose a methodology that helps to automatically generate Web Services from the FORMbased query interfaces of a web site. Since the majority of web data are rather “hidden ” behind such a FORM interface, we believe turning such a human-oriented query interface into machine-oriented web services is an important problem. Toward this goal, we adopt the Wrapper technology successfully developed and deployed in Database community, and demonstrate how to generate Web Services components (e.g., WSDL, UDDI, SOAP) automatically. We present the overall architecture of our developed prototype and a few showcases based on real web sites.
Identifying Value Mappings for Data Integration An Unsupervised Approach.
Abstract. The Web is a distributed network of information sources where the individual sources are autonomously created and maintained. Consequently, syntactic and semantic heterogeneity of data among sources abound. Most of the current data cleaning solutions assume that the data values referencing the same object bear some textual similarity. However, this assumption is often violated in practice. “Two-door front wheel drive ” can be represented as “2DR-FWD ” or “R2FD”, or even as “CAR TYPE 3 ” in different data sources. To address this problem, we propose a novel two-step automated technique that exploits statistical dependency structures among objects which is invariant to the tokens representing the objects. The algorithm achieved a high accuracy in our empirical study, suggesting that it can be a useful addition to the existing information integration techniques. 1
Deep Set Operators for XQuery.
There are three set operators defined in XQuery, namely union, intersect and except. They take node sequences as operands, in which each node is identified by its node-ID and treated as an atomic entity. However, according to XML semantics, each node is “a set of set(s)”, which have descendants in a tree-structured hierarchy. Unfortunately, the regular set operators as described above ignored this structural feature of XML data. On the other hand, some XML applications can be benefited from set operators with different semantics considering ancestor-descendant relationships between nodes. In this extended semantics, the comparison during query processing are conducted not only on nodes of both operands, but also on their descendants, in a “deep” manner. In this paper, we identify the needs of such “deep” set operators and propose the deep-union, deep-intersect and deep-except operators. We further explore their properties as well as relationships to regular set operators, and present a preliminary experience on implementing them as user-defined functions of XQuery. 1.
Taxonomy of XML schema languages using formal language theory.
On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).
Designing Triggers with Trigger%2DBy%2DExample.
One of the obstacles that hinder database trigger systems from their wide deployment is the lack of tools that aid users in creating trigger rules. Similar to understanding and specifying database queries in SQL3, it is di#cult to visualize the meaning of trigger rules. Furthermore, it is even more di#cult to write trigger rules using such text-based trigger rule language as SQL3. In this paper, we propose TBE (Trigger-By-Example) to remedy such problems in writing trigger rules visually by using  QBE (Query-By-Example) ideas. TBE is a visual trigger rule composition system that helps the users understand and specify active database triggers. TBE retains benefits of QBE while extending features to support triggers. Hence, TBE is a useful tool for novice users to create simple triggers in a visual and intuitive manner. Further, since TBE is designed to hide the details of underlying trigger systems from users, it can be used as a universal trigger interface.
Report on the 6th ACM international workshop on web information and data management %28WIDM 2004%29 held at CIKM 2004.

On six degrees of separation in DBLP%2DDB and more.
An extensive bibliometric study on the db community using the collaboration network constructed from DBLP data is presented. Among many, we have found that (1) the average distance of all db scholars in the network has been stabilized to about 6 for the last 15 years, coinciding with the so-called six degrees of separation phenomenon; (2) In sync with Lotka’s law on the frequency of publications, the db community also shows that a few number of scholars publish a large number of papers, while the majority of authors publish a small number of papers (i.e., following the power-law with exponent about-2); and (3) with the increasing demand to publish more, scholars collaborate more often than before (i.e., 3.93 collaborators per scholar and with steadily increasing clustering coefficients). 1.
Sixth ACM CIKM International Workshop on Web Information and Data Management %28WIDM 2004%29

QFilter fine%2Dgrained run%2Dtime XML access control via NFA%2Dbased query rewriting.
At present, most of the state-of-the-art solutions for XML access controls are either (1) document-level access control techniques that are too limited to support fine-grained security enforcement; (2) view-based approaches that are often expensive to create and maintain; or (3) impractical proposals that require substantial security-related support from underlying XML databases. In this paper, we take a different approach that assumes no security support from underlying XML databases and examine three alternative fine-grained XML access control solutions, namely primitive, pre-processing and post-processing approaches. In particular, we advocate a pre-processing method called QFilter that uses Non-deterministic Finite Automata (NFA) to rewrite user&#039;s query such that any parts violating access control rules are pruned. We show the construction and execution of a QFilter and demonstrate its superiority to other competing methods.
Counting Relaxed Twig Matches in a Tree.
We consider the problem of accurately estimating the number  of approximate XML answers for a given query, and propose an  e#cient method that (1) accurately computes selectivity estimates for  each relaxed XML query, using a natural generalization of the correlated  subpath tree (CST) summary structure, and (2) carefully combines these  estimates by analyzing the nature of overlap between the di#erent relaxed  twig queries.
System Support for Name Authority Control Problem in Digital Libraries OpenDBLP Approach.
Abstract. In maintaining Digital Libraries, having bibliographic data up-to-date is critical, yet often minor irregularities may cause information isolation. Unlike documents for which various kinds of unique ID systems exist (e.g., DOI, ISBN), other bibliographic entities such as author and publication venue do not have unique IDs. Therefore, in current Digital Libraries, tracking such bibliographic entities is not trivial. For instance, suppose a scholar changes her last name from A to B. Then, a user, searching for her publications under the new name B, cannot get old publications that appeared under A although they are by the same person. For such a scenario, since both A and B are the same person, it would be desirable for Digital Libraries to track their identities accordingly. In this paper, we investigate this problem known as name authority control, and present our system-oriented solution. We first identify three core building blocks that underlie the phenomenon, and show taxonomy where different combinations of the building blocks can occur. Then, we consider how systems can support the problem in two common functions of Digital Libraries- Update and Search. Finally, our test-bed called OpenDBLP is presented where the suggested solution is fully implemented as a proof of the concept. 1.
PaSE Locating Online Copy of Scientific Documents Effectively.
Abstract. The need for fast and vast dissemination of research results has led a new trend such that more number of authors post their documents to personal or group Web spaces so that others can easily access and download them. Similarly, more and more researchers use online search for accessing documents of interest in Web, instead of paying a visit to libraries. Currently, to locate and download an online copy of a particular document D, one typically (1) uses Search Engines with the citation information and browses through returned web pages (e.g., author’s homepage) to see if any contains D, or (2) uses searching facilities of an individual Digital Library (e.g., CiteSeer, e-Print) looking for D, and if not found, repeats the search in another Digital Library. However, the scheme (1) involves human browsing to get to the final online copy, while the scheme (2) suffers from incomplete coverage. To remedy these shortcomings, in this paper, we present a system, named as PaSE, which can effectively locate online copies (e.g., PDF or PS) of scientific documents using citation information. We consider a myriad of alternatives in crawling and parsing the Web to arrive at the right document quickly, and present a preliminary experimental study. Using some of the best alternatives that we have identified, we show that PaSE can locate online copy of documents more accurately and conveniently than human users would do at the cost of elongated search time. 1
A Flexible Framework for Architecting XML Access Control Enforcement Mechanisms.
Abstract. Due to the growing interest in XML security, various access control schemes have been proposed recently. However, little effort has been put forth to facilitate a uniform analysis and comparison of these schemes under the same framework. This paper presents a first attempt toward a flexible framework that can capture the design principles and operations of existing XML access control mechanisms. Under this framework, we observe that most existing XML access control mechanisms share the same design principle with slightly different orderings of underlying building blocks (i.e., data, query, and access control rule). Furthermore, according to the framework, we identify four plausible approaches to implement XML access controls, namely built-in, view-based, pre-processing and post-processing. Finally, we compare the actual performance of different approaches. 1
Supporting XML Security Models Using Relational Databases A Vision.
As the secure distribution and sharing of information over  the World Wide Web becomes increasingly important, the needs for flexible  and e#cient support of access control systems naturally arise. Since  the eXtensible Markup Language (XML) is emerging as the format of  the Internet era for storing and exchanging information, there have been,  recently, many proposals to extend the XML model to incorporate security  aspects. To the lesser or greater extent, however, such proposals  neglect the fact that the data for XML documents will most likely reside  in relational databases, and consequently do not utilize various security  models proposed for and implemented in relational databases.
Schema Conversion Methods between XML and Relational Models.
In this chapter, three semantics-based schema conversion methods are presented:  1) CPI converts an XML schema to a relational schema while preserving semantic  constraints of the original XML schema, 2) NeT derives a nested structured  XML schema from a flat relational schema by repeatedly applying the nest operator  so that the resulting XML schema becomes hierarchical, and 3) CoT takes a relational  schema as input, where multiple tables are interconnected through inclusion dependencies  and generates an equivalent XML schema as output.
NeT %26 CoT translating relational schemas to XML schemas using semantic constraints.
Two algorithms, called NeT and CoT, to translate relational schemas to XML schemas using various semantic constraints are presented. The XML schema representation we use is a language-independent formalism named XSchema, that is both precise and concise. A given XSchema can be mapped to a schema in any of the existing XML schema language proposals. Our proposed algorithms have the following characteristics: (1) NeT derives a nested structure from a flat relational model by repeatedly applying the nest operator on each table so that the resulting XML schema becomes hierarchical, and (2) CoT considers not only the structure of relational schemas, but also semantic constraints such as inclusion dependencies during the translation. It takes as input a relational schema where multiple tables are interconnected through inclusion dependencies and converts it into a good XSchema. To validate our proposals, we present experimental results using both real schemas from the UCI repository and synthetic schemas from TPC-H.
XML to Relational Conversion Using Theory of Regular Tree Grammars.
In this paper, we study the different steps  of translation from XML to relational mod-  els, while maintaining semantic constraints.
NeT %26 CoT Inferring XML Schemas from Relational World.

A Personalization Technique using Multiple Decision Tree in Recommender System.

Semantic Data Modeling Using XML Schemas.
Most research on XML has so far largely neglected the data  modeling aspects of XML schemas. In this paper, we attempt to make  a systematic approach to data modeling capabilities of XML schemas.
Taxonomy of XML Schema Languages Using Formal Language Theory.
On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).
On the Explanation of Factors Affecting E%2DCommerce Adoption.
The Internet has grown at a remarkable pace since the emergence of the World-Wide Web in the early 1990s. While electronic commerce (e-Commerce) has become an important issue with the growth of the Internet, there has been insufficient empirical research concerning its adoption by Internet users. In this paper, we propose the e-Commerce Adoption Model (e-CAM), which attempts to examine important factors that predict a consumer’s online purchasing behavior. e-CAM integrates the technology acceptance model with the theories of perceived risk to explain the adoption of e-Commerce. Specifically, we examine the impact of the following factors on the consumer’s purchasing behavior: perceived ease of use, perceived usefulness, perceived risk with products/services, and perceived risk in the context of online transaction. We test the e-CAM model using the structural equation modeling technique. Most of the causal relationships between the constructs postulated by our model are well supported, accounting for 33.4 percent of the total variance in e-Commerce adoption. In sum, our study finds that all of the antecedent constructs directly and/or indirectly affect the consumer’s adoption of e-Commerce. Therefore, the findings suggest that firms providing products/services through e-Commerce should consider these contextual factors in order to facilitate consumers ’ adoption behavior.
Nesting%2DBased Relational%2Dto%2DXML Schema Translation.
this paper, we study the problems in this con- version. Especially, we are interested in finding XML schema (e.g., DTD, XML-Schema, RELAX) that best describes the existing relational schema. Having the XML schema that precisely describes the semantics and structures of the original relational data is important to further maintain the converted XML documents in future. We first present a straightforward relational to XML translation algorithm, called Flat Translation (FT). Since FT maps the fiat relational model to the fiat XML model in a one-to-one manner, it does not utilize the regular expression of element content models at all. Then, we present our ongoing work, called Nesting-based Translation (NET), to remedy the problems found in FT. NeT derives nested structures from a fiat relational model by the use of the nest operator so that the resulting DTD is more intuitive and precise than otherwise
CPI Constraints%2DPreserving Inlining algorithm for mapping XML DTD to relational schema.
As Extensible Markup Language (XML) is emerging as the data format of the In- ternet era, there are increasing needs to efficiently store and query XML data. One path to this goal is transforming XML data into relational format in order to use relational database technology. Although several transformation algorithms exist, they are incomplete in the sense that they focus only on structural aspects and ignore semantic aspects. In this paper, we present the semantic knowledge that needs to be captured during transformation to ensure a correct relational schema. Further, we show an algorithm that can 1) derive such semantic knowledge from a given XML Document Type Definition (DTD) and 2) preserve the knowledge by representing it as semantic constraints in relational database terms. By combining existing transformation algorithms and our constraints-preserving algorithm, one can transform XML DTD to relational schema where correct semantics and be- haviors are guaranteed by the preserved constraints. Experimental results are also presented.
Towards Intelligent Semantic Caching for Web Sources.
An intelligent semantic caching scheme suitable for web sources is presented. Since web sources typically have weaker querying capabilities than conventional databases, existing semantic caching schemes cannot be directly applied. Our proposal takes care of the difference between the query capabilities of an end user system and web sources. In addition, an analysis on the match types between a user&#039;s input query and cached queries is presented. Based on this analysis, we present an algorithm that finds the best matched query under different circumstances. Furthermore, a method to use semantic knowledge, acquired from the data, to avoid unnecessary access to web sources by transforming the cache miss to the cache hit is presented. To verify the effectiveness of the proposed semantic caching scheme, we first show how to generate synthetic queries exhibiting different levels of semantic localities. Then, using the test sets, we show that the proposed query matching technique is an efficient and effective way for semantic caching in web databases.
TBE Trigger%2DBy%2DExample.
Triggers have been adopted as an important database feature and implemented by most major database vendors. Despite their diverse potential usages, one of the obstacles that hinder the triggers from its wide deployment is the lack of tools that aid users to create complex trigger rules in a simple manner. Although the majority of the users of triggers are DBAs or savvy end-users, writing trigger rules is still a daunting task. On the other hand, QBE (Query-By-Example) has been very popular as a user interface forcreating queries in an interactive and intuitive manner since its introduction decades ago. It is being used in most modern database products in its disguised form. Since its underlying theory is based on the relational calculus, its expressive power is proved to be equivalent to that of SQL. Therefore, it is an ideal tool for novice users to create simple queries in visual fashion. At the same time, expert users do not have to compromise anything because QBE supports full capability to create complex queries. In this paper, we shall present a novel user interface for creating trigger rules, called TBE (Trigger-By-Example), by marrying the triggers and QBE in a seamless fashion. The visual nature ofthe TBE makes writing trigger rules much easier. We show how trigger rules in the emerging SQL standard
Constraints%2DPreserving Transformation from XML Document Type Definition to Relational Schema.
As Extensible Markup Language (XML) [5] is emerging as  the data format of the internet era, there are increasing needs to efficiently  store and query XML data. One way towards this goal is using  relational database by transforming XML data into relational format.
TBE A Graphical Interface for Writing Trigger Rules in Active Databases.
One of the obstacles that hinder trigger systems from their wide deployment is the lack of tools that aid users to create trigger rules. Similar to understanding and specifying database queries in SQL3, it is difficult to visualize the meaning of trigger rules. Furthermore, it is even more difficult to write trigger rules using such text-based trigger rule language as SQL3. In this paper, we propose TBE (Trigger-By-Example) to remedy such problems in writing trigger rules by using QBE (Query-ByExample) ideas. TBE is a graphical trigger rule specification language and system to help the users understand and specify active database triggers. TBE retains benefits of QBE while extending features to support triggers. Hence, TBE is a useful tool for novice users to create simple triggers in a visual and intuitive manner. Further, since TBE is designed to hide the details of underlying trigger systems from users, it can be used as a universal trigger interface.
Comparative Analysis of Six XML Schema Languages.
As XML [5] is emerging as the data format of the inter- net era, there is an substantial increase of the amount of data in XML format. To better describe such XML data structures and constraints, several XML schema languages have been proposed. In this paper, we present a comparative analysis of six noteworthy XML schema languages.
Semantic Caching via Query Matching for Web Sources.
A semantic caching scheme suitable for wrappers wrapping web sources is presented. Since the web sources have typically weaker querying capabilities than conventional databases, existing semantic caching schemes cannot be applied directly. A seamlessly integrated query translation and capability mapping between the wrappers and web sources in semantic caching is described. In addition, an analysis on the match types between the user&#039;s input query and cached queries is presented. Semantic knowledge acquired from the data can be used to avoid unnecessary access to the web sources by transforming the cache miss to the cache hit. A polynomial time algorithm based on the proposed query matching technique is presented to find the best matched query in the cache. Experimental results reveal the effectiveness of the proposed semantic caching scheme.  1 Introduction  Web databases allow users to pose queries to distributed and heterogeneous web sources. Such systems usually consist of three com...
Digital Libraries for the Next Millennium Challenges and Research Directions.

Conjunctive Point Predicate%2Dbased Semantic Caching for Wrappers in Web Databases.
A semantic caching scheme suitable for web database environments is proposed. In our scheme, tasks for query translation /capability mapping (named as query naturalization)  between wrappers and web sources and tasks for semantic caching are seamlessly integrated, resulting in easier query optimization. A semantic cache consists of three components: 1) semantic view , a description of the contents in the cache using sub-expressions of the previous queries, 2)  semantic index , an index for the tuple IDs that satisfy the semantic view, and 3) physical storage, a storage containing the tuples (or objects) that are shared by all semantic views in the cache. Types of matching between the native query and cache query are discussed. Algorithms for finding the optimal match of the input query in semantic cache and for cache replacement are presented. The proposed techniques are being implemented in a cooperative web database (CoWeb) prototype at UCLA.  1 Introduction  Two techniques for imple...
Generating Advanced Query Interfaces.
g the burden from users of having to know the interface and query language specifics of the individual information sources. The tool accepts as input a high-level specification of the interface and produces as output its implementation. There are two aspects to each visual interface generated by our tool. One has to do with the layout of the various visual components in the interface and the way they interact in response to user actions. The other has to do with the way the interface supports the language interactions with the back-end system. This interaction includes the mapping from the queries constructed in the visual interface to queries supported by the underlying system, and the mapping from individual query elements of the underlying language to visual elements of the interface. Since our goal in devising the generator was not to study which visual layout is best suited for our target applications, all interfaces generated by our tool share the same layout. The tool, however, 
